A Resolution-Based Proof Method for Temporal Logics of Knowledge and Belief
نویسندگان
چکیده
In this paper we define two logics, KLn and BLn, and present resolutionbased proof methods for both. KLn is a temporal logic of knowledge. Thus, in addition to the usual connectives of linear discrete temporal logic, it contains a set of unary modal connectives for representing the knowledge possessed by agents. The logic BLn is somewhat similar: it is a temporal logic that contains connectives for representing the beliefs of agents. The proof methods we present for these logics involve two key steps. First, a formula to be tested for unsatisfiability is translated into a normal form. Secondly, a family of resolution rules are used, to deal with the interactions between the various operators of the logics. In addition to a description of the normal form and the proof methods, we present some short worked examples and proposals for future work.
منابع مشابه
Resolution-Based Proof for Multi-Modal Temporal Logics of Knowledge
Temporal logics of knowledge are useful in order to specify complex systems in which agents are both dynamic and have information about their surroundings. We present a resolution method for propositional temporal logic combined with multi-modal S5 and illustrate its use on examples. This paper corrects a previous proposal for resolution in multi-modal temporal logics of knowledge.
متن کاملSequent Calculi for Branching Time Temporal Logics of Knowledge and Belief
In this paper we consider branching time temporal logics of knowledge and belief. These logics involve the discrete time linear temporal logic operators “next” and “until” with the branching temporal logic operator “on all paths”. The latter operator is interpreted with respect to a version of the bundle semantics. In addition the temporal logic of knowledge (belief) contains an indexed set of ...
متن کاملClausal Resolution for CTL*
In this paper we consider proof techniques for branching-time temporal logics. While a considerable amount of research has been carried out regarding the relationship between finite automata and such logics, practical proof techniques for such logics have received relatively little attention. Recently, however, several applications requiring refined proof methods for branching-time temporal log...
متن کاملA Tableau-Based Proof Method for Temporal Logics of Knowledge and Belief
In this paper we deene two logics, KL n and BL n , and present tableau-based decision procedures for both. KL n is a temporal logic of knowledge. Thus, in addition to the usual connectives of linear discrete temporal logic, it contains a set of unary modal connectives for representing the knowledge possessed by agents. The logic BL n is somewhat similar; it is a temporal logic that contains con...
متن کاملResolution for Temporal Logics of Knowledge
A resolution based proof system for a temporal logic of knowledge is presented and shown to be correct. Such logics are useful for proving properties of distributed and multi-agent systems. Examples are given to illustrate the proof system. An extension of the basic system to the multimodal case is given and illustrated using the ‘muddy children problem’.
متن کامل